An Efficient Algorithm for Point Set Registration Using Analytic Differential Approach

نویسندگان

  • Ching-Chi Chen
  • Wei-Yen Hsu
  • Shih-Hsuan Chiu
  • Yung-Nien Sun
چکیده

Image registration is an important topic in medical image analysis. It is usually used in 2D mosaics to construct the whole image of a biological specimen or in 3D reconstruction to build up the structure of an examined specimen from a series of microscopic images. Nevertheless, owing to a variety of factors, including microscopic optics, mechanisms, sensors, and manipulation, there may be great differences between the acquired image slices even if they are adjacent. The common differences include the chromatic aberration as well as the geometry discrepancy that is caused by cuts, tears, folds, and deformation. They usually make the registration problem a difficult challenge to achieve. In this paper, we propose an efficient registration method, which consists of a feature-based registration approach based on analytic robust point matching (ARPM) and a refinement procedure of the feature-based Levenberg-Marquardt algorithm (FLM), to automatically reconstruct 3D vessels of the rat brains from a series of microscopic images. The registration algorithm could speedily evaluate the spatial correspondence and geometric transformation between two point sets with different sizes. In addition, to achieve subpixel accuracy, an FLM method is used to refine the registered results. Due to the nonlinear characteristic of FLM method, it converges much faster than most other methods. We evaluate the performance of proposed method by comparing it with well-known thin-plate spline robust point matching (TPS-RPM) algorithm. The results indicate that the ARPM algorithm together with the FLMmethod is not only a robust but efficient method in image registration. key words: brain mapping, medical image registration, analytic robust point matching (ARPM), Levenberg-Marquardt algorithm, spatial correspondence, neuro-informatics

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DPML-Risk: An Efficient Algorithm for Image Registration

Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...

متن کامل

An Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients

Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...

متن کامل

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

Using finite difference method for solving linear two-point fuzzy boundary value problems based on extension principle

In this paper an efficient Algorithm based on Zadeh's extension principle has been investigated to approximate fuzzy solution of two-point fuzzy boundary value problems, with fuzzy boundary values. We use finite difference method in term of the upper bound and lower bound of $r$- level of fuzzy boundary values. The proposed approach gives a linear system with crisp tridiagonal coefficients matr...

متن کامل

An algorithm for the anchor points of the PPS of the CCR model

Anchor DMUs are a new class in the general classification of Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). An anchor DMU in DEA is an extreme-efficient DMU that defines the transition from the efficient frontier to the free-disposability part of the boundary of the Production Possibility Set (PPS). In this paper, the anchor points of the PPS of the CCR model are investigated....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 93-D  شماره 

صفحات  -

تاریخ انتشار 2010